Diverse Replication for Single-Machine Byzantine-Fault Tolerance
نویسندگان
چکیده
New single-machine environments are emerging from abundant computation available through multiple cores and secure virtualization. In this paper, we describe the research challenges and opportunities around diversified replication as a method to increase the Byzantine-fault tolerance (BFT) of single-machine servers to software attacks or errors. We then discuss the design space of BFT protocols enabled by these new environments.
منابع مشابه
Byung-gon Chun
International Computer Science Institute, Berkeley, CA 2007 – Present Postdoctoral Researcher, Networking Group, working with Prof. Scott Shenker, Dr. Petros Maniatis, and Dr. Sylvia Ratnasamy Diverse replication for single-machine Byzantine-fault tolerance: Investigate exploiting cores in many-core systems to defend against software attacks. Explore different isolation and software diversity m...
متن کاملBrief Announcement: Practical Synchronous Byzantine Consensus
This paper presents new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The PBFT state machine replication protocol tolerates f Byzantine faults in an asynchronous setting using n = 3f + 1 replicas. We improve the Byzantine fault tolerance to n = 2f + 1 by utilizing the synchrony assumption. Our protocol also solves synchro...
متن کاملZeno: Eventually Consistent Byzantine-Fault Tolerance
Many distributed services are hosted at large, shared, geographically diverse data centers, and they use replication to achieve high availability despite the failure of an entire data center. Recent events show that non-crash faults occur in these services and may lead to long outages. While Byzantine Fault Tolerance (BFT) could be used to withstand these faults, current BFT protocols can becom...
متن کاملByzantine Fault Tolerance Can Be Fast
Byzantine fault tolerance is important because it can be used to implement highly-available systems that tolerate arbitrary behaviorfrom faulty components. This paper presents a detailed performance evaluation of BFT, a state-machine replication algorithm that tolerates Byzantine faults in asynchronous systems. Our results contradict the common belief that Byzantine fault tolerance is too slow ...
متن کاملIntrusion - Tolerant Parsimonious State Machine Replication ∗
We describe a Byzantine-fault-tolerant state machine replication algorithm that reduces computation and communication costs in the fault-free case, and is reasonably efficient even in the presence of faults. Such an algorithm is practically significant, because failures are the exception than the norm, and much of a system’s runtime is fault-free. The algorithm is geared towards applications th...
متن کامل